2

A branch-and-cut algorithm for the k-edge connected subgraph problem

F. Bendali, I. Diarrassouba, A.R. Mahjoub, M. Didi Biha, J. Mailfert
Journal:
Networks
Year:
2010
Language:
english
File:
PDF, 301 KB
english, 2010
3

On the minimum cut separator problem

Walid Ben-Ameur, Mohamed Didi Biha
Journal:
Networks
Year:
2012
Language:
english
File:
PDF, 169 KB
english, 2012
5

Steiner trees and polyhedra

M. Didi Biha, H. Kerivin, A.R. Mahjoub
Journal:
Discrete Applied Mathematics
Year:
2001
Language:
english
File:
PDF, 175 KB
english, 2001
6

An exact algorithm for solving the vertex separator problem

Mohamed Didi Biha, Marie-Jean Meurs
Journal:
Journal of Global Optimization
Year:
2011
Language:
english
File:
PDF, 166 KB
english, 2011
7

k-edge connected polyhedra on series-parallel graphs

M.Didi Biha, A.R. Mahjoub
Journal:
Operations Research Letters
Year:
1996
Language:
english
File:
PDF, 607 KB
english, 1996
10

Steiner k-Edge Connected Subgraph Polyhedra

M. Didi Biha, A.R. Mahjoub
Journal:
Journal of Combinatorial Optimization
Year:
2000
Language:
english
File:
PDF, 91 KB
english, 2000
12

On the 3-Terminal Cut Polyhedron

Biha, Mohamed Didi
Journal:
SIAM Journal on Discrete Mathematics
Year:
2005
Language:
english
File:
PDF, 208 KB
english, 2005
13

Polyhedral study of the connected subgraph problem

Didi Biha, Mohamed, Kerivin, Hervé L.M., Ng, Peh H.
Journal:
Discrete Mathematics
Year:
2015
Language:
english
File:
PDF, 465 KB
english, 2015
14

Extended cuts

Ben-Ameur, Walid, Didi Biha, Mohamed
Journal:
Journal of Combinatorial Optimization
Year:
2016
Language:
english
File:
PDF, 237 KB
english, 2016
15

-cuts and some related issues

Ben-Ameur, Walid, Biha, Mohamed Didi
Journal:
Operations Research Letters
Year:
2018
Language:
english
File:
PDF, 239 KB
english, 2018